Cstd Fast Isosurface Extraction Using Quasi Monte Carlo Methods

نویسندگان

  • Krzysztof Sikorski
  • Frank Stenger
  • Christopher Johnson
چکیده

A new algorithm for isosurface extraction is proposed and implemented The algorithm is based on the new mathematical understanding of the theory of the quasi Monte Carlo methods Di erent from the general isosurface extracting meth ods which work on the whole data set this algorithm works on a subset of the orig inal large three dimensional data set which is generated by the quasi Monte Carlo method The isosurface is generated on this subset data as an approximation to the isosurface generated from the whole data set Hammersley Halton and Hyperbolic Cross points are used as the quasi Monte Carlo points in the implementation The results show that the QMC techniques enjoy a linear speedup with the number of QMC points For large data sets we usually can reduce the data size remarkbaly and still get a good representation of the original isosurface The advantage of the techniques becomes more prominent when the data size gets larger The QMC points generally generate visually better and smoother isosurfaces and these isosurfaces represent the overall shape of the original isosurfaces better than a regular subset of the original data The preprocessing of the QMC isosurface extraction might be time consuming But this is a one time process After it is done the postisosurface extraction is very fast

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quasi-monte Carlo Methods in Computer Graphics, Part I: the Qmc-buuer

Monte Carlo integration is often used for antialiasing in rendering processes. Due to low sampling rates only expected error estimates can be stated, and the variance can be high. In this article quasi-Monte Carlo methods are presented, achieving a guaranteed upper error bound and a convergence rate essentially as fast as usual Monte Carlo.

متن کامل

Efficient Bottom-up Approaches to Build Variation-aware PLL Behavioral Models

Using the behavioral model of a circuit to perform Behavioral Monte Carlo Simulation (BMCS) is a fast approach to estimate performance shift under process variation with detailed circuit responses. However, accurate Monte Carlo analysis results are difficult to obtain if the behavioral model is not accurate enough. Therefore, this paper proposes to use an efficient bottom-up approach to generat...

متن کامل

Using ray intersection for dual isosurfacing

Isosurface extraction using " dual contouring " approaches have been developed to generate a surface that is " dual " in terms of the underlying extraction procedure used when compared to the standard Marching Cubes (MC) method. These approaches address some shortcomings of the MC methods including feature-detection within a cell and better triangles. One approach for preserving " sharp feature...

متن کامل

An Approach in Radiation Therapy Treatment Planning: A Fast, GPU-Based Monte Carlo Method

Introduction: An accurate and fast radiation dose calculation is essential for successful radiation radiotherapy. The aim of this study was to implement a new graphic processing unit (GPU) based radiation therapy treatment planning for accurate and fast dose calculation in radiotherapy centers. Materials and Methods: A program was written for parallel runnin...

متن کامل

The Florida State University College of Arts and Science Scrambled Quasirandom Sequences and Their Applications

Quasi-Monte Carlo methods are a variant of ordinary Monte Carlo methods that employ highly uniform quasirandom numbers in place of Monte Carlo’s pseudorandom numbers. Monte Carlo methods offer statistical error estimates; however, while quasi-Monte Carlo has a faster convergence rate than normal Monte Carlo, one cannot obtain error estimates from quasi-Monte Carlo sample values by any practical...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003